Advice Complexity and Barely Random Algorithms
نویسندگان
چکیده
منابع مشابه
Advice Complexity and Barely Random Algorithms
Recently, a new measurement – the advice complexity – was introduced for measuring the information content of online problems. The aim is to measure the bitwise information that online algorithms lack, causing them to perform worse than offline algorithms. Among a large number of problems, a well-known scheduling problem, job shop scheduling with unit length tasks, and the paging problem were a...
متن کاملBarely Random Algorithms for Multiprocessor Scheduling
We present randomized online algorithms for scheduling on m = 3; : : : ; 7 machines. For two machines, a randomized algorithm achieving a competitive ratio of 4 3 was found by Bartal, Fiat, Karloo and Vohra 3]. These same authors show a matching lower bound. Seiden has presented a randomized algorithm which achieves competitive ratios of 1. A barely random algorithm is one which a distribution ...
متن کاملComplexity-Restricted Advice Functions
We consider uniform subclasses of the nonuniform complexity classes de ned by Karp and Lipton via the notion of advice functions These subclasses are obtained by restricting the complexity of computing correct advice We also investigate the e ect of allowing advice functions of limited complexity to depend on the input rather than on the input s length Among other results using the notions desc...
متن کاملOnline Algorithms with Advice⋆
In online problems, the input forms a finite sequence of requests. Each request must be processed, i. e., a partial output has to be computed only depending on the requests having arrived so far, and it is not allowed to change this partial output subsequently. The aim of an online algorithm is to produce a sequence of partial outputs that optimizes some global measure. The most frequently used...
متن کاملCommunication algorithms with advice
We study the amount of knowledge about a communication network that must be given to its nodes in order to efficiently disseminate information. Our approach is quantitative: we investigate the minimum total number of bits of information (minimum size of advice) that has to be available to nodes, regardless of the type of information provided. We compare the size of advice needed to perform broa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: RAIRO - Theoretical Informatics and Applications
سال: 2011
ISSN: 0988-3754,1290-385X
DOI: 10.1051/ita/2011105